package Day25;
import java.util.*;
public class A3 {


    /**
     * 分割等和子串
     */
    static int target;
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int[] nums = new int[n]; //>0
            int sum=0;
            for(int i=0;i<n;i++) {
                nums[i]=in.nextInt();
                sum += nums[i];
            }
            if(sum%2!=0) {
                System.out.print(false);
            }else {
                target = sum /2;
                if(dfs(nums,0,0)) System.out.print(true);
                else System.out.print(false);
            }
        }
    }
    public static boolean dfs(int[] nums,int pos,int path) {
        if(path>=target || pos >= nums.length) {
            if(path==target) return true;
            return false;
        }
        for(int i=pos;i<nums.length;i++) {
            path += nums[i];
            boolean bool = dfs(nums,i+1,path);
            if(bool) return true;
            path -= nums[i]; //剪枝
        }
        return false;
    }
}
